A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems

A computational intelligence algorithm for expensive engineering optimization problems

The modern engineering design optimization process often replaces laboratory experiments with computer simulations, which leads to expensive black-box optimization problems. Such problems often contain candidate solutions which cause the simulation to fail, and therefore they will have no objective value assigned to them, a scenario which degrades the search effectiveness. To address this, this...

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

Global optimization algorithms for bound constrained problems

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems - Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded b...

An interval branch and bound algorithm for bound constrained optimization problems

In this paper, we propose modiications to a prototypical branch and bound algorithm for nonlinear optimization so that the algorithm eeciently handles constrained problems with constant bound constraints. The modiications involve treating subregions of the boundary identically to interior regions during the branch and bound process, but using reduced gradients for the interval Newton method. Th...